Universal Temporal Data Languages

نویسندگان

  • Cindy X. Chen
  • Carlo Zaniolo
چکیده

Temporal reasoning and temporal query languages present diicult research challenges , which are slowly yielding to the combined attack of many investigations motivated by the theoretical interest and practical import of the problem. In this paper, we subscribe to TSQL2 insofar as practical requirements for a query language are concerned, but we propose a solution that overcomes its shortcomings, particularly the lack of universality whereby TSQL2 temporal extensions can not be easily applied to other query languages, such as QBE and Datalog. In this paper, we use Datalog as a framework to develop a new language | Temporal Data Language (TDL). To support our claim of universality, we argue that TDL constructs and semantics can be directly applied to derive temporal extensions of languages, such as QBE and SQL. Finally, we evaluate alternative approaches to the implementation of TDL, using as the basis for implementation the LDL++ system with extended aggregates developed at UCLA.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pebble Automata for Data Languages: Expressiveness and Decidability

In this paper we study pebble automata (PA) for data languages. Namely, we show that the expressive power of PA increases as the number of pebbles increases and that PA is strictly less expressive than monadic second order logic. We also determine a subclass of PA languages for which the emptiness problem is decidable. This subclass is robust: The alternating, nondeterministic and deterministic...

متن کامل

Do differences in brain activation challenge universal theories of dyslexia?

It has been commonly agreed that developmental dyslexia in different languages has a common biological origin: a dysfunction of left posterior temporal brain regions dealing with phonological processes. Siok, Perfetti, Jin, and Tan (2004, Nature, 431, 71-76) challenge this biological unity theory of dyslexia: Chinese dyslexics show no deficits in posterior temporal brain regions but a functiona...

متن کامل

The Complexity of Constraint Satisfaction Problems∗

The tractability conjecture for constraint satisfaction problems (CSPs) describes the constraint languages over a finite domain whose CSP can be solved in polynomial-time. The precise formulation of the conjecture uses basic notions from universal algebra. In this talk, we give a short introduction to the universal-algebraic approach to the study of the complexity of CSPs. Finally, we discuss a...

متن کامل

On Pebble Automata for Data Languages with Decidable Emptiness ProblemI,II

In this paper we study a subclass of pebble automata (PA) for data languages for which the emptiness problem is decidable. Namely, we show that the emptiness problem for weak 2-pebble automata is decidable, while the same problem for weak 3-pebble automata is undecidable. We also introduce the so-called top view weak PA. Roughly speaking, top view weak PA are weak PA where the equality test is ...

متن کامل

Hierarchies of Modal and Temporal

We introduce and study hierarchies of extensions of the propositional modal and temporal languages with pairs of new syntactic devices: "point of reference | reference pointer" which enable semantic references to be made within a formula. We propose three diierent but equivalent semantics for the extended languages, discuss and compare their expressiveness. The languages with reference pointers...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998